|
Frank Harary (March 11, 1921 – January 4, 2005) was a prolific American mathematician, who specialized in graph theory. He was widely recognized as one of the "fathers" of modern graph theory.〔 Harary was a master of clear exposition and, together with his many doctoral students, he standardized the terminology of graphs. He broadened the reach of this field to include physics, psychology, sociology, and even anthropology. Gifted with a keen sense of humor, Harary challenged and entertained audiences at all levels of mathematical sophistication. A particular trick he employed was to turn theorems into games - for instance, students would try to add red edges to a graph on six vertices in order to create a red triangle, while another group of students tried to add edges to create a blue triangle (and each edge of the graph had to be either blue or red). Because of the simplest case of Ramsey theory, one team or the other would have to win. ==Biography== Frank Harary was born in New York City, the oldest child to a family of Jewish immigrants from Syria and Morocco. He earned his bachelor's and master's degrees from Brooklyn College in 1941 and 1945 respectively〔(Frank Harary 1921-2005 - Columbia University )〕 and his Ph.D. from University of California at Berkeley in 1948. During 1948-1986 he was with the University of Michigan. From 1987 he was Professor (and Distinguished Professor Emeritus) in the Computer Science Department at New Mexico State University in Las Cruces. He was one of the founders of the ''Journal of Combinatorial Theory'' and the ''Journal of Graph Theory''.〔(Frank Harary ), a biographical sketch at the ACM SIGACT site〕 He died at Memorial Medical Center in Las Cruces, New Mexico.〔 〕 Frank Harary's interests would shift much during his very long and diverse academic career. His interests during the beginnings of his undergrad were mainly in the field of physics, however when he began research for his doctorate his attention was turned to abstract algebra, specifically the study of Boolean-like rings. Shortly after being awarded his doctorate for his research on Boolean-like rings, Harary was appointed as an instructor for the Department of Mathematics at the University of Michigan in 1948. Harary's first publication would follow within his first year; in 1949 Harary published ''On the algebraic structure of knots''. Shortly after this publication in 1953 Harary published his first book (jointly with George Uhlenbeck) ''On the number of Husimi trees''. It was following this text that Harary began to build up a worldwide reputation for his work in graph theory. In 1965 Harary's first book ''Structural models: An introduction to the theory of directed graphs'' was published, and For the rest of his life Harary's interest would be in the field of Graph Theory. While beginning his work in graph theory around 1965, Harary began buying up property in Ann Arbor to supplement income for his family. Harary and his wife Jayne had six children together, Miriam, Natalie, Judith, Thomas, Joel and Chaya. In 1969 ''The Michigan Daily'' published an article discussing issues that tenants of Harary's property were facing. Harary's motivation for purchasing these properties was in the interest of the land value, and as issues arose within the properties in terms of maintaining a safe living environment negative attention was turned towards Harary. It was Harary's intention to maintain ownership of the land and see the tenants out of their apartments while helping them find better housing.〔(Article from MacTutor )〕 From 1973 to 2007 Harary jointly wrote five more books, each in the field of graph theory. In the time before his death, Harary traveled the world researching and publishing papers (with some 300 different co-authors) which appeared in mathematical journals and other scientific publication. Harary recoded that he lectured in 166 different cities around the United States and some 274 cities in over 80 different countries. Harary was particularly proud that he had given lectures in cities around the world beginning with every letter of the alphabet, even including "X" when he traveled to Xanten, Germany. Harary also played a curious role in the award-winning film Good Will Hunting. The film displayed formulas he had published on the enumeration of trees, which were supposed to be fiendishly difficult.〔()〕 It was in 1986 at the age of 65 that Harary retired from his professorship at the University of Michigan. Harary did not take his retirement lightly however, following his retirement Harary was appointed as a ''Distinguished Professor of Computer Sciences'' at New Mexico State University in Las Cruces. He held this position until his death in 2005. The same year as his retirement Harary was made an honorary fellow of the National Academy of Sciences of India, he also served as an editor for about 20 different journals focusing primarily on graph theory and combinatorial theory. It was following his retirement that Harary was elected to be an honorary lifetime member of the Calcutta Mathematical Society and of the South African Mathematical Society. At the time of his death in Las Cruces other members of the department of Computer Science felt the loss for the great mind that once worked beside them. The head of the department of Computer Science at the time of Harary's death Desh Ranjan had this to say, "''Dr. Harary was a true scholar with a genuine love for graph theory which was an endless source of new discoveries, beauty, curiosity, surprises and joy for him till the very end of his life.''"〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Frank Harary」の詳細全文を読む スポンサード リンク
|